Automating Proof in Non-standard Analysis
نویسنده
چکیده
Non-standard analysis provides a framework to carry out formally calculus proofs in a much more intuitive manner than in the 2 − δ formulation of Weierstraß. This paper introduces the notions of proof-planning and rippling, and gives an example showing how they can be applied to non-standard analysis to produce readable proofs. We present the related work in the area and give an outline of the proposed work.
منابع مشابه
Invariant Discovery via Failed Proof Attempts
We present a framework for automating the discovery of loop invariants based upon failed proof attempts. The discovery of suitable loop invariants is a bottle neck for automatic veriication of imperative programs. Using the proof planning framework we reconstruct standard heuristics for developing invariants. We relate these heuristics to the analysis of failed proof attempts allowing us to dis...
متن کاملNuprl as Logical Framework for Automating Proofs in Category Theory
We describe the construction of a semi-automated proof system for elementary category theory using the Nuprl proof development system as logical framework. We have used Nuprl’s display mechanism to implement the basic vocabulary and Nuprl’s rule compiler to implemented a first-order proof calculus for reasoning about categories, functors and natural transformations. To automate proofs we have f...
متن کاملA new security proof for FMNV continuous non-malleable encoding scheme
A non-malleable code is a variant of an encoding scheme which is resilient to tampering attacks. The main idea behind non-malleable coding is that the adversary should not be able to obtain any valuable information about the message. Non-malleable codes are used in tamper-resilient cryptography and protecting memories against tampering attacks. Many different types of non-malleability have alre...
متن کاملUsing proof-planning to investigate the structure of proof in non-standard analysis
This thesis presents an investigation into the structure of proof in non-standard analysis using proof-planning. The theory of non-standard analysis, developed by Robinson in the 1960s, offers a more algebraic way of looking at proof in analysis. Proof-planning is a technique for reasoning about proof at the meta-level. In this thesis, we use it to encapsulate the patterns of reasoning that occ...
متن کاملAutomating (Specififation = Implementation) Using Equational Reasoning and LOTOS
We explore some of the problems of veriication by trying to prove that some sort of relationship holds between a given speciication and implementation. We are particularly interested in the decisions taken in the process of establishing and formalising the veriication requirements and of automating the proof. Despite the apparent simplicity of the original problem, the veriication is non-trivia...
متن کامل